Timed Semantics of Message Sequence Charts Based on Timed Automata
نویسندگان
چکیده
منابع مشابه
Automata and Logics for Timed Message Sequence Charts
We provide a framework for distributed systems that impose timing constraints on their executions. We propose a timed model of communicating finite-state machines, which communicate by exchanging messages through channels and use event clocks to generate collections of timed message sequence charts (T-MSCs). As a specification language, we propose a monadic secondorder logic equipped with timin...
متن کاملSampled Semantics of Timed Automata
Sampled semantics of timed automata is a finite approximation of their dense time behavior. While the former is closer to the actual software or hardware systems with a fixed granularity of time, the abstract character of the latter makes it appealing for system modeling and verification. We study one aspect of the relation between these two semantics, namely checking whether the system exhibit...
متن کاملSemantics of Message Sequence Charts
The language of MSC diagrams is widely used for the specification of communicating systems, the design of software and hardware for real time and reactive systems, and other industrial applications. Often it is used as an abstraction of systems specified in SDL or UML (in the form of sequence diagrams). In this paper, a novel representation of the semantics of message sequence charts is describ...
متن کاملOn the Semantics of Message Sequence Charts
Stefan Leue Institute for Informatics University of Berne Uinggassstrasse 51 CH-3012 Berne, Switzerland [email protected] We give an informal exposition of a finite-state semantics for Message Sequence Chart (MSC) specifications. We interpret each MSC specification as a transit ion system of global states, from which we can define a Biichi automaton by considering safety and liveness properties...
متن کاملUnfoldings for Message Passing Timed Automata
In this thesis we develop a state space reduction technique for networks of timed automata based on unfoldings to alleviate the state space explosion problem due to concurrently enabled actions. For the purpose of verifying a system, standard model checking techniques construct its sequential state space that su ers an exponential growth when applied to distributed systems because of concurrent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2002
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80475-4